A fast IPv6 packet classification algorithm based on efficient multi-bit selection
نویسندگان
چکیده
Decision tree based schemes are widely used in designing high-speed packet classification algorithms. The primary objective is to construct a decision tree with minimal storage and searching time complexity. In this paper, we proposed a novel decision tree packet classification algorithm based on Efficient Multiple Bit Selection (EMBS). In the proposed algorithm, prefix fields are transformed to a set of independent bits; and multiple arbitrary bits are selected to cut nodes when building the decision tree. A Performance Estimate Function (PEF) and an efficient bit selecting algorithm are exploited to determine which bits should be selected to obtain an efficient decision tree with high performance. The proposed EMBS algorithm is capable of handling range match fields, and it is suitable for IPv6 packet classification as well as IPv4. Evaluation results show that EMBS provides a great improvement over recent decision tree based algorithms in both space requirement and searching performance. 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Scalable Packet Classification for IPv6 by Using Limited TCAMs
It has been demonstrated that performing packet classification on a potentially large number of filters on key header fields is difficult and has poor worst-case performance. To achieve fast packet classification, hardware support is unavoidable. Ternary content-addressable memory (TCAM) has been widely used to perform fast packet classification due to its ability to solve the problem in O(1) t...
متن کاملDesign of multi-field IPv6 packet classifiers using ternary CAMs
Typically, high-end routers/switches classify a packet by looking for multiple fields of the IP/TCP headers and recognize which flow the packet belongs to. Several packet classification algorithms to accelerate packet processing and reduce the memory requirement have been proposed. But it is not easy to implement these algorithms in hardware to lookup these multiple fields in the same time. Thi...
متن کاملMultiway range trees: scalable IP lookup with fast updates
Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, e...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 33 شماره
صفحات -
تاریخ انتشار 2010